Convexity and marginal vectors
نویسندگان
چکیده
In this paper we construct sets of marginal vectors of a TU game with the property that if the marginal vectors from these sets are core elements, then the game is convex. This approach leads to new upperbounds on the number of marginal vectors needed to characterize convexity. Another result is that the relative number of marginals needed to characterize convexity con-
منابع مشابه
Characterizing convexity of games using marginal vectors
This paper studies the relation between convexity of TU games and marginal vectors. Shapley (1971) andIchiishi (1981) showed that a game is convex if and only if all marginal vectors are core elements. In Rafels,Ybern (1995) it is shown that if all even marginal vectors are core elements, then all odd marginal vectorsare core elements as well, and vice versa. Hence, if all even or a...
متن کاملConvexity in Stochastic Cooperative Situations
This paper introduces a new model concerning cooperative situations in which the payoffs are modeled by random variables. First, we study adequate preference relations of the agents. Next, we define corresponding cooperative games and we introduce and study various basic notions like an allocation, the core and marginal vectors. Furthermore, we introduce three types of convexity, namely coaliti...
متن کاملOn Superadditivity and Convexity for Cooperative Games with Random Payoffs
In this paper we study the relations between superadditivity and several types of convexity for cooperative games with random payoffs. The types of convexity considered are marginal convexity (all marginal vectors belong to the core), individual-merge convexity (any individual player is better off joining a larger coalition) and coalitional-merge convexity (any coalition of players is better of...
متن کاملOn the Extreme Points of the Core of Neighbour Games and Assignment Games
Neighbour games arise from certain matching or sequencing situations in which only some specific pairs of players can obtain a positive gain. As a consequence, neighbour games are as well assignment games as line graph restricted games. We will show that the intersection of the class of assignment games and the class of line graph restricted games yields the class of neighbour games. Further, w...
متن کاملStrong convexity of NTU games
In this paper, we provide an alternative definition of NTU convexity, strongly ordinal convexity. We show that if a game is strongly ordinal convex, then any marginal worth vector is in the core, and any marginal contribution is increasing. Some economic examples satisfy this convexity. KeywordsCooperative game; Convex game; NTU game; Core; Supermodularity JEL classification codes: C62; D52; D53
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Game Theory
دوره 31 شماره
صفحات -
تاریخ انتشار 2003